Revisiting Higher-Order Masked Comparison for Lattice-Based Cryptography: Algorithms and Bit-Sliced Implementations
نویسندگان
چکیده
Masked comparison is one of the most expensive operations in side-channel secure implementations lattice-based post-quantum cryptography, especially for higher masking orders. First, we introduce two new masked algorithms, which improve arithmetic D’Anvers et al. (2021) and hybrid method Coron respectively. We then look into implementation-specific optimizations, show that small specific adaptations can have a significant impact on overall performance. Finally, implement various state-of-the-art algorithms benchmark them same platform (ARM-Cortex M4) to allow fair between them. with factor $\approx 20\%$ by using Galois Field multiplications 25\%$ streamlining design. Our improvements speedup straightforward implementation 33\%$ . discuss differences provide testing framework ease future research.
منابع مشابه
Light-Weight Instruction Set Extensions for Bit-Sliced Cryptography
Bit-slicing is a non-conventional implementation technique for cryptographic software where an n-bit processor is considered as a collection of n 1-bit execution units operating in SIMD mode. Particularly when implementing symmetric ciphers, the bit-slicing approach has several advantages over more conventional alternatives: it often allows one to reduce memory footprint by eliminating large lo...
متن کاملHigher-Order Threshold Implementations
Higher-order differential power analysis attacks are a serious threat for cryptographic hardware implementations. In particular, glitches in the circuit make it hard to protect the implementation with masking. The existing higher-order masking countermeasures that guarantee security in the presence of glitches use multi-party computation techniques and require a lot of resources in terms of cir...
متن کاملConstruction algorithms for higher order polynomial lattice rules
Higher order polynomial lattice point sets are special types of digital higher order nets which are known to achieve almost optimal convergence rates when used in a quasi-Monte Carlo algorithm to approximate high-dimensional integrals over the unit cube. Recently it has been shown that higher order polynomial lattice point sets of “good” quality must exist. However, it was not shown how to cons...
متن کاملLattice Based Cryptography for Beginners
The purpose of this lecture note is to introduce lattice based cryptography, which is thought to be a cryptosystem of post-quantum age. We have tried to give as many details possible specially for novice on the subject. Something may be trivial to an expert but not to a novice. Many fundamental problems about lattice are thought to be hard even against quantum computer, compared to factorizatio...
متن کاملLattice-Based Cryptography
In this chapter we describe some of the recent progress in lattice-based cryptography. Lattice-based cryptographic constructions hold a great promise for post-quantum cryptography, as they enjoy very strong security proofs based on worst-case hardness, relatively efficient implementations, as well as great simplicity. In addition, lattice-based cryptography is believed to be secure against quan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computers
سال: 2023
ISSN: ['1557-9956', '2326-3814', '0018-9340']
DOI: https://doi.org/10.1109/tc.2022.3197074